Maximum Block Improvement and Polynomial Optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Block Improvement and Polynomial Optimization

In this paper we propose an efficient method for solving the spherically constrained homogeneous polynomial optimization problem. The new approach has the following three main ingredients. First, we establish a block coordinate descent type search method for nonlinear optimization, with the novelty being that we only accept a block update that achieves the maximum improvement, hence the name of...

متن کامل

Maximum Block Improvement Method and Its Applications

We consider compressed sensing of piecewise constant signals, which have sparse gradients and arise frequently from problems of practical interests. We use total variation minimization to recover such signals from a small number of measurements. We establish the proof for the performance guarantee of total variation (TV) minimization in recovering one-dimensional signal with sparse gradient sup...

متن کامل

On Convergence of the Maximum Block Improvement Method

The so-called MBI (maximum block improvement) method is a greedy type approach to solve optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is relatively easy, the MBI method then advocates to update the block of variables corresponding to the maximally improving block at e...

متن کامل

Efficiency improvement in an nD systems approach to polynomial optimization

The problem of finding the global minimum of a so-called Minkowski-norm dominated polynomial can be approached by the matrix method of Stetter-Möller, which reformulates it as a large eigenvalue problem. A drawback of this approach is that the matrix involved is usually very large. However, all that is needed for modern iterative eigenproblem solvers (such as methods based on Arnoldi and Jacobi...

متن کامل

Maximum Load and Minimum Volume Structural Optimization

A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2012

ISSN: 1052-6234,1095-7189

DOI: 10.1137/110834524